package dp;

/**
 * Created with IntelliJ IDEA.
 * Description: 96. 不同的二叉搜索树
 * User: Li_yizYa
 * Date: 2025/7/8
 * Time: 17:13
 */
public class Solution7 {
    public static int numTrees(int n) {
        if (n <= 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(numTrees(10));
    }
}
